Hash Function Design Principles Supporting Variable Output Lengths from One Small Function
نویسندگان
چکیده
In this paper, we introduce new hash function design principles with variable output lengths (multiple of n). It is based on a function or a block cipher which has output size n. In the random oracle model it has optimal collision resistance which requires Θ(2) queries to find (t + 1)n-bit hash output collisions, where t is any positive integer. Similarly, in the ideal cipher model, Θ(2) queries are required to find (t+ 1)n-bit hash output collisions.
منابع مشابه
Compression Function Design Principles Supporting Variable Output Lengths from a Single Small Function
In this paper, we introduce new compression function design principles supporting variable output lengths (multiples of size n). They are based on a function or block cipher with an n-bit output size. In the case of the compression function with a (t + 1)n-bit output size, in the random oracle and ideal cipher models, their maximum advantages from the perspective of collision resistance are O( ...
متن کاملEdon-R, An Infinite Family of Cryptographic Hash Functions
We propose a new infinite family of cryptographic hash functions, Edon–R, based on a recently defined candidate one-way function. Edon–R is a class of hash functions with variable output lengths. It is de fined using quasigroups and quasigroup string trans formations.
متن کاملWeaknesses in the HAS-V Compression Function
HAS-V is a cryptographic hash function which processes 1024-bit message blocks and produces a hash value of variable length. The design of the hash function is based on design principles of the MD4 family. Recently, weaknesses have been shown in members of this family. Therefore, the analysis of the HAS-V hash function is of great interest. To the best of our knowledge this is the first article...
متن کاملA Design of Cryptographic Hash Function Group with Variable Output-Length Based on SHA-1
The cryptographic hash function provides the services of information security, authentication, integrity, non-reputation in a branch of information secret. A cryptographic hash function has been developed since MD4 was proposed by Rivest. In present, U.S standard of a hash function is SHA-1 with 160 bits of output length. It is difficult to be sure of a security of a hash function with 160 bits...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کامل